Maximal subgroups of amalgams of finite inverse semigroups

Amalgams of Free Inverse Semigroups

We study inverse semigroup amalgams of the form S U T where S and T are free inverse semigroups and U is an arbitrary nitely generated inverse subsemigroup of S and T. We make use of recent work of Bennett to show that the word problem is decidable for any such amalgam. This is in contrast to the general situation for semigroup amalgams, where recent work of Birget, Margolis and Meakin shows th...

A Note on Amalgams of Inverse Semigroups

Amalgams of inverse semigroups and reversible two-counter machines

We show that the word problem for an amalgam [S1, S2;U,ω1, ω2] of inverse semigroups may be undecidable even if we assume S1 and S2 (and therefore U) to have finite R-classes and ω1, ω2 to be computable functions, interrupting a series of positive decidability results on the subject. This is achieved by encoding into an appropriate amalgam of inverse semigroups 2-counter machines with sufficien...

Maximal Subgroups of Finite Groups

What ingredients are necessary to describe all maximal subgroups of the general finite group G? This paper is concerned with providing such an analysis. A good first reduction is to take into account the first isomorphism theorem, which tells us that the maximal subgroups containing a given normal subgroup N of G correspond, under the natural projection, to the maximal subgroups of the quotient...

Stallings Foldings and Subgroups of Amalgams of Finite Groups

In the 1980’s Stallings [35] showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse automaton. This allows for the deep algorithmic theory of finite automata and finite inverse monoids to be used to answer questions about finitely generate...